Constrained neighbor lists for SPH-based fluid simulations

نویسندگان

  • Rene Winchenbach
  • Hendrik Hochstetter
  • Andreas Kolb
چکیده

In this paper we present a new approach to create neighbor lists with strict memory bounds for incompressible Smoothed Particle Hydrodynamics (SPH) simulations. Our proposed approach is based on a novel efficient predictive-corrective algorithm that locally adjusts particle support radii in order to yield neighborhoods of a user-defined maximum size. Due to the improved estimation of the initial support radius, our algorithm is able to efficiently calculate neighborhoods in a single iteration in almost any situation. We compare our neighbor list algorithm to previous approaches and show that our proposed approach can handle larger particle numbers on a single GPU due to its strict guarantees and is able to simulate more particles in real time due to its benefits in regard to performance. Additionally we demonstrate the versatility and stability of our approach in several different scenarios, for example multi-scale simulations and with different kernel functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SPH: Towards Flood Simulations

Flood simulation is a complex problem involving large masses of fluid, soil watering, erosion and collision. We will demonstrate the flood simulation of cities were the fluid particles collide with a complex city model. For the fluid simulation we had used Smoothed Particle Hydrodynamics (SPH) method, by which we gained less expensive computation than by using other known methods of water simul...

متن کامل

Fluid Simulation by the Smoothed Particle Hydrodynamics Method: A Survey

This paper presents a survey of Smoothed Particle Hydrodynamics (SPH) and its use in computational fluid dynamics. As a truly mesh-free particle method based upon the Lagrangian formulation, SPH has been applied to a variety of different areas in science, computer graphics and engineering. It has been established as a popular technique for fluid based simulations, and has been extended to succe...

متن کامل

Fast GPU-Based Fluid Simulations Using SPH

Graphical Processing Units (GPUs) are massive floatingpoint stream processors, and through the recent development of tools such as CUDA and OpenCL it has become possible to fully utilize them for scientific computing. We have developed an open-source CUDA-based acceleration framework for 3D Computational Fluid Dynamics (CFD) using Smoothed Particle Hydrodynamics (SPH). This paper describes the ...

متن کامل

Efficient Neighbor Search for Particle-based Fluids

Lagrangian particle-based animation is a popular strategy for simulating complex phenomena as fluids. Due to its inherent mesh-less nature the set of neighbor particles within a specified range must be efficiently found. In this paper we propose Cell Indexing a novel approach for searching approximate neighbor particles necessary for efficient fluid simulation using SPH. Instead of storing part...

متن کامل

Adaptive Smoothed Particle Hydrodynamics Neighbor Search Algorithm for Large Plastic Deformation Computational Solid Mechanics

Smoothed Particle Hydrodynamics (SPH) has quickly become one of the most popular mesh-free methods since its introduction in 1977. In the recent years, a great amount of research has been focused on addressing some of the common computational time associated with the SPH method. One of the remaining hurdles is the long computational associated with building the neighbor list. Because of the nat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016